Efficient Query Optimization : A novel approach for generating optimal query plans using Iterative Improvement and Simulated Annealing
نویسنده
چکیده
The collection of various sites, distributed over a computer network is called Distributed Database whereas the technique of finding the optimal processing method to answer a query is called Query Optimization. In Distributed Database, the sites communicate with each other through networks. There are various issues arise during evaluation of query cost, among which the processing cost and a transmission cost are the important. There are several algorithm developed to find the best possible solution for a particular query, but they all have their certain limitations. The primary objective of distributed query plan is to generate the query plan that reduces the quantity of data transfer between sites and also the distributed query response time. In distributed database system the data is scattered over various multiple sites and a single relation may be present in more than one sites. In such case the cost of query processing is effected by various cost involved such as optimization cost, communication cost, local processing cost, query localization cost etc .The optimizer is mainly concern on the cost model, search space, and the search strategy. It primarily focuses on these three factors. The query cost depends on the order of evaluation of the operators, for the same query we can have different cost if the order is changed. Hence, to find the optimal cost for a particular query is emerging as an open challenge for many researchers. Therefore the cost-based query optimization technique has emerged as an important concept for dealing with the query optimization. In this paper, the optimal query plan is generated by applying the concept of iterative improvement algorithm and simulated annealing algorithm and then the comparative study of both results are done using same heuristic to generate the optimal query plans. Keyword : Distributed Query Optimization, Simulated Annealing, Iterative Improvement, Distributed Database, Cost based Optimization. Efficient Query Optimization : A novel approach for generating optimal query plans using Iterative Improvement and Simulated Annealing Pramod Kumar Yadav* SAM Rizvi** IJCTA, 9(21), 2016, pp. 243-249 © International Science Press * KIET Group of Institutions, Ghaziabad, UP, India [email protected] ** Jamia Millia Islamia, New Delhi, India [email protected]
منابع مشابه
An Empirical Comparison of Randomized Algorithms for Large Join Query Optimization
Non-traditional database applications need new query optimization algorithms to speed up large join queries. In the last decade, general techniques such as iterative improvement and simulated annealing: have been extensively investigated for solving large join query optimization problems. In this paper, we compare a genetic algorithm with iterative improvement and simulated annealing for the op...
متن کاملFast, Randomized Join-Order Selection - Why Use Transformations?
We study the effectiveness of probabilistic selection of join-query evaluation plans, t&hout reliance on tree transformation rules. Instead, each candidate plan is chosen uniformly at random from the space of valid evaluation orders. This leads to a transformation-free strategy where a sequence of random plans is generated and the plans are compared on their estimated costs. The success of this...
متن کاملUsing design of experiments approach and simulated annealing algorithm for modeling and Optimization of EDM process parameters
The main objectives of this research are, therefore, to assess the effects of process parameters and to determine their optimal levels machining of Inconel 718 super alloy. gap voltage, current, time of machining and duty factor are tuning parameters considered to be study as process input parameters. Furthermore, two important process output characteristic, have been evaluated in this research...
متن کاملA Novel Method for Designing and Optimization of Networks
In this paper, system planning network is formulated with mixed-integer programming. Two meta-heuristic procedures are considered for this problem. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematica...
متن کاملOptimal Placement and Sizing of TCSC & SVC for Improvement Power System Operation using Crow Search Algorithm
Abstract: The need for more efficient power systems has prompted the use of a new technologies includes Flexible AC transmission system (FACTS) devices. FACTS devices provides new opportunity for controlling the line power flow and minimizing losses while maintaining the bus voltages within a permissible limit. In this thesis a new method is proposed for optimal placement and sizing of Thyristo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016